Modelling Spatial Substructure in Wildlife Populations using an Approximation to the Shortest Path Voronoi Diagram
نویسنده
چکیده
In the field of conservation biology, accurate population models are important for managing wildlife. It has been acknowledged that spatial structure should form an integral part of such models. Advancement in the power of desktop computers has allowed biologists to construct individual-based, spatially-explicit simulation models to predict the population dynamics of species. These models take into account local interactions and output emergent trends. However, whilst in many cases such models have been useful, for large landscapes, they may still be too computationally expensive. An alternative approach is to construct a metapopulation model. These are usually less computationally expensive, and whilst they often incorporate less detail than spatially-explicit models, they may still include enough spatial structure to be ecologically realistic. However, the assumption made in metapopulation models, that any individual within a patch can interact with any other individual of the patch may not always be appropriate. For example, in social species where the size of the social group home range is much smaller than the average patch size, individuals in a social group from one part of the patch may not interact with individuals from another social group in another part the patch. In such cases it is useful to consider spatial structure within the patch itself. In this paper we propose using the Shortest Path Voronoi Diagram (SPVD) to model the spatial structure within patches for social species. For such a diagram we use seeds to represent the centres of the social groups in each patch. We then assign each point of the patch to the seed it is closest to (where distance is measured with the shortest path metric). This partitions each patch containing seeds into regions. Together these regions form the SPVD. By linking the seeds of neighbouring Voronoi regions with shortest paths, a network among social groups is created. This can be used to model the dispersal paths of a population. Whilst analytic algorithms exist for the construction of the SPVD, these have often been developed for a polygonal domain. In complex landscapes, the time-complexity of such algorithms may become just as slow as grid-based approximations. Moreover, analytic methods may be less numerically robust and harder to extend to more complex variations of the Voronoi diagram. In this paper we offer a new grid-based approximation for the shortest path Voronoi diagram referred to as the quadtree-grid Voronoi Diagram (or qgrid VD). The construction procedure involves a decomposition of the landscape into a quadtree, and a propagation of circular wavefronts from each seed through a grid that is laid over the quadtree structure. We show how the q-grid VD can be applied to a wildlife population model using a squirrel glider (Petaurus norfolcensis) population in a semi-rural landscape as an example. By averaging outputs across multiple qgrid VDs we generate a time series of density maps. Such maps could be useful for informing wildlife management.
منابع مشابه
Approximate Shortest Path Queries Using Voronoi Duals
We propose an approximation method to answer point-to-point shortest path queries in undirected edge-weighted graphs, based on random sampling and Voronoi duals. We compute a simplification of the graph by selecting nodes independently at random with probability p. Edges are generated as the Voronoi dual of the original graph, using the selected nodes as Voronoi sites. This overlay graph allows...
متن کاملSmoothing Voronoi-Based Path with Minimized Length and Visibility Using Composite Bezier Curves
We present an obstacle avoiding path planning method based on a Voronoi diagram. We use a tactical visibility measure to obtain the shortest path length with the lowest local probability to be discovered based on the map topology. A Voronoi-based navigation mesh for finding the shortest smooth path with the lowest visibility along the path is used. The piecewise linear rough path in the Voronoi...
متن کاملAn Optimal Algorithm for L1 Shortest Paths Among Obstacles in the Plane (Draft)
We present an optimal Θ(n log n) algorithm for determining shortest paths according to the L1 (L∞) metric in the presence of disjoint polygonal obstacles in the plane. Our algorithm requires only linear O(n) space to build a planar subdivision (a Shortest Path Map) with respect to a fixed source point such that the length of a shortest path from the source to any query point can be reported in ...
متن کاملVoronoi Diagram for services neighboring a highway
We are given a transportation line where displacements happen at a bigger speed than in the rest of the plane. A shortest time path is a path between two points which takes less than or equal time to any other. We consider the time to follow a shortest time path to be the time distance between the two points. In this paper, we give a simple algorithm for computing the Time Voronoi Diagram, that...
متن کاملComputing L1 Shortest Paths among Polygonal Obstacles in the Plane
Given a point s and a set of h pairwise disjoint polygonal obstacles of totally n vertices in the plane, we present a new algorithm for building an L1 shortest path map of size O(n) in O(T ) time and O(n) space such that for any query point t, the length of the L1 shortest obstacleavoiding path from s to t can be reported in O(log n) time and the actual shortest path can be found in additional ...
متن کامل